"This site requires JavaScript to work correctly"
minimize Header

Prof. Dr. Johannes Grabmeier, Diplom-Mathematiker, M.Sc.

Professor für Business Informatics

Faculty of Computer Science

Lecturers

Lecturer

Master Degree Coordinator Business Informatics, Chair of Examination Board I (WI, KI, AID) and II (AI, IAS, CS, CY, LSI), Deputy Chair Senate, Member of University Council

K 205

0991/3615-141

consulting time

by appointment via E-Mail

Sortierung:
Journal article
  • Johannes Grabmeier

Young-Alternation und Garnir-Relationen.

In: Bayreuther Mathematische Schriften pg. 23-37

  • (1981)
Journal article
  • Johannes Grabmeier

Unzerlegbare Moduln mit trivialer Youngquelle und Darstellungstheorie der Schuralgebra.

In: Bayreuther Mathematische Schriften pg. 9-152

  • (1985)
Journal article
  • Johannes Grabmeier

Kombinatorische Probleme aus der Darstellungstheorie der GLm(k).

In: Publications de l'I.R.M.A., Seminaire Lotharingien de Combinatoire pg. 131-136

  • (1986)
Journal article
  • Johannes Grabmeier
  • A. Kerber

The evaluation of irreducible polynomial representations of the general linerar groups and of the unitary groups over fields of characteristic 0.

In: Acta Applicandae Mathematicae pg. 271-291

  • (1987)

show abstract

We describe an efficient method for the computer evaluation of the ordinary irreducible polynomial representations of general linear groups using an integral form of the ordinary irreducible representations of symmetric groups. In order to do this, we first give an algebraic explanation of D. E. Littlewood's modification of I. Schur's construction. Then we derive a formula for the entries of the representing matrices which is much more concise and adapted to the effective use of computer calculations. Finally, we describe how one obtains — using this time an orthogonal form of the ordinary irreducible representations of symmetric groups — a version which yields a unitary representation when it is restricted to the unitary subgroup. In this way we adapt D. B. Hunter's results which heavily rely on Littlewood's methods, and boson polynomials come into the play so that we also meet the needs of applications to physics.
Book
  • G. Dueck
  • Johannes Grabmeier
  • G. Jaeschke

VLSI Complexity of Basic Arithmetic Operations.

Wissenschaftliches Zentrum: Heidelberg Scientific Center technical reports, IBM Deutschland GmbH Stuttgart

  • (1988)
Journal article
  • Johannes Grabmeier

On the socle of Weyl modules.

In: Archiv der Mathematik vol. 50 pg. 319-322

  • (1988)
Journal article
  • H. Gollan
  • Johannes Grabmeier

Algorithms in Representation Theory and their Realization in the Computer Algebra.

In: Bayreuther Mathematische Schriften pg. 1-23

  • (1990)
Book
  • Johannes Grabmeier
  • K. Huber
  • U. Krieger

Das Computeralgebrasystem AXIOM bei kryptologischen und verkehrstheoretischen Untersuchungen des Forschungsinstituts der Deutschen Bundespost TELEKOM.

Wissenschaftliches Zentrum: Heidelberg Scientific Center technical reports, IBM Deutschland GmbH Stuttgart

  • (1991)
Journal article
  • M. Clausen
  • A. Dress
  • Johannes Grabmeier
  • M. Karpinski

On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields.

In: Theoretical Computer Science vol. 84 pg. 151-164

  • (1991)

DOI: 10.1016/0304-3975(91)90157-W

Journal article
  • A. Dress
  • Johannes Grabmeier

The Interpolation Problem for k-sparse Polynomials and Character Sums.

In: Advances in Applied Mathematics vol. 12 pg. 57-75

  • (1991)

show abstract

Motivated by a remarkable result of D. Y. Grigoriev and M. Karpinski, the interpolation problem for k-sparse multivariate polynomials has received some attention in recent years. In this note we want to show that essentially all of the results obtained so far hold more generally for k-sparse sums of characters of abelian monoids, thereby providing a useful unified approach to this active field of research. As it turns out, there are basically two different situations, in the first one reduction to the (rather trivial) case of cyclic monoids is possible, in the general case we can handle direct products of abelian monoids by using informations about the factors. Basic ingredients of these approaches are the construction of distinction sets for characters and zero-test sets for k-sparse character sums.
Journal article
  • Johannes Grabmeier
  • A. Scheerhorn

Finite Fields in AXIOM.

In: AXIOM Technical Report Series

  • (1992)

show abstract

Finite fields play an important role for many applications (e.g. coding theory, cryptography). There are different ways to construct a finite field for a given prime power. The paper describes the different constructions implemented in AXIOM. These are polynomial basis representation, cyclic group representation, and normal basis representation. Furthermore, the concept of the implementation, the used algorithms and the various datatype coercions between these representations are discussed.
Contribution
  • Johannes Grabmeier
  • R. Wisbauer

Computations in Algebras of Finite Rank.

In: Computational Algebra; Lectures Notes in Pure and Applied Mathematics. Proceedings of the Mid-Atlantic Conference 1992 pg. 131-165

  • Eds.:
  • K. Fischer
  • et al.

New York, NY, USA

  • (1993)
Book
  • R. Jenks
  • R. Sutor
  • Johannes Grabmeier

Axiom. The scientific computation system.

Springer Verlag, Marketed and distributed by the Numerical Algorithms Group New York; Downer's Grove, Ill., USA

  • (1992)
Journal article
  • A. Duer
  • Johannes Grabmeier

Applying Coding Theory to Interpolation.

In: SIAM Journal on Computing vol. 22 pg. 695-704

  • (1993)
BookEdited

Computeralgebra in Deutschland: Bestandsaufnahme, Möglichkeiten, Perspektiven.

  • Eds.:
  • Johannes Grabmeier
  • et al.

Passau; Heidelberg

  • (1993)
Contribution
  • J. Fleischer
  • Johannes Grabmeier
  • et al.

Computer Algebra in Science and Engineering.

In: Konferenzband der Konferenz am Zentrum für interdisziplinäre Forschung (ZiF) Bielefeld. pg. 317-330

  • Eds.:
  • J. Fleischer
  • Johannes Grabmeier
  • W. Küchlin
  • F. Hehl

World Scientific Singapore

  • (1995)
ConferenceProceedings

Konferenzband der Konferenz am Zentrum für interdisziplinäre Forschung (ZiF) Bielefeld.

  • Eds.:
  • J. Fleischer
  • Johannes Grabmeier
  • W. Küchlin
  • F. Hehl

World Scientific Singapore

  • (1994)
Contribution
  • Johannes Grabmeier

An Application of a Symbolic Version of the Raleigh-Ritz Method to the Design of Aircraft Turbines.

In: Computer algebra in science and engineering. 28-31 August 1994, Bielefeld, Germany pg. 317-330

  • Eds.:
  • J. Fleischer

World Scientific Singapore; River Edge, N.J

  • (1995)
Journal article
  • Johannes Grabmeier

Computeralgebra - eine Säule des Wissenschaftlichen Rechnens.

In: it+ti - Informationstechnik und Technische Informatik vol. 37 pg. 5-20

  • (1995)
Journal article
  • Johannes Grabmeier

Data Mining - Mythos oder Realität?.

In: Business Computing

  • (1996)
Contribution
  • Johannes Grabmeier

Eine Einführung in die Computeralgebra-Algorithmen zur Symbolischen Integration.

In: KfK-Seminarreihe Aktuelle Forschungsgebiete der Mathematik des Forschungszentrums Karlsruhe. pg. 69-113

  • Eds.:
  • T. Westermann
  • R. Seifert

Karlsruhe

  • (1996)
ConferenceProceedings

Symbolic rewriting techniques. [contains invited and contributed papers to the Symbolic Rewriting Techniques Workshop, which was held in the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995].

In: Progress in computer science and applied logic vol. 15

  • Eds.:
  • V. Weispfenning
  • Johannes Grabmeier
  • M. Bronstein

Symbolic Rewriting Techniques Workshop Birkhäuser Basel [u.a.]

  • (1998)
Journal article
  • Johannes Grabmeier

Computeralgebra - symbolisches und exaktes Rechnen.

In: Spektrum der Wissenschaft pg. 27-31

  • (1999)
Contribution
  • Johannes Grabmeier
  • et al.

Cohomology Computations for p-Groups.

In: Algebraic combinatorics and applications. Proceedings of the Euroconference Algebraic Combinatorics and Applications (ALCOMA), held in Gößweinstein, Germany, September 12 - 19, 1999

  • Eds.:
  • A. Betten

Springer Verlag Berlin [u.a.]

  • (2001)
Contribution
  • Johannes Grabmeier
  • J. Buhmann
  • R. Kruse
  • H. Timm

Segmentierende und clusterbildende Methoden.

In: Handbuch Data Mining im Marketing. Knowledge discovery in marketing databases (Business computing) pg. 299-361

  • Eds.:
  • H. Hippner
  • M. Meyer
  • K. Wilde
  • U. Küsters

Vieweg Wiesbaden

  • (2001)
Journal article
  • Johannes Grabmeier
  • A. Rudolph

Techniques of Cluster Analysis in Data Mining.

In: Data Mining and Knowledge Discovery pg. 303-360

  • (2002)
Lecture
  • Günther Benstetter
  • R. Schmidt
  • S. Ascher
  • M. Kerber
  • Johannes Grabmeier
  • A. Huber

Evaluation of thin oxide reliability by means of wafer level stress-testing.

In: 8th European Parametric Test User Group Meeting

Prien am Chiemsee

  • April 2002 (2002)
Contribution
  • Johannes Grabmeier

Critical Load Computations for Jet Engines.

In: Computer algebra handbook. Foundations, applications, systems

  • Eds.:
  • V. Weispfenning
  • Johannes Grabmeier
  • E. Kaltofen

Springer Verlag New York

  • (2003)
Contribution
  • Johannes Grabmeier
  • et al.

Computer Algebra - Today and Tomorrow.

In: Computer algebra handbook. Foundations, applications, systems

  • Eds.:
  • V. Weispfenning
  • Johannes Grabmeier
  • E. Kaltofen

Springer Verlag New York

  • (2003)
Contribution
  • Johannes Grabmeier

AXIOM, a Computer Algebra System with Abstract Data Types.

In: Computer algebra handbook. Foundations, applications, systems

  • Eds.:
  • V. Weispfenning
  • Johannes Grabmeier
  • E. Kaltofen

Springer Verlag New York

  • (2003)
Journal article
  • Johannes Grabmeier

Eine goldene Regel für die Modellierung von Daten zur Erstellung von Data-Mining-Klassifikationsmodellen unter besonderer Berücksichtigung von Problemstellungen in der Versicherungswirtschaft.

  • (2005)
Journal article
  • Johannes Grabmeier
  • et al.

Decision trees for binary classification variables grow equally with the Gini impurity measure and Pearson’s chi-square test.

In: International Journal of Business Intelligence and Data Mining vol. 2 pg. 213-226

  • (2007)

show abstract

We show that for binary classification variables, Gini and Pearson purity measures yield exactly the same tree, provided all the other parameters of the algorithms are identical. A counter-example for ternary classification variables is given.
Contribution
  • Johannes Grabmeier

Some Mathematical Aspects of Neural Net.

In: Technical Report MRSSC.

Chicago, IL, USA

  • (2009)
Journal article
  • Johannes Grabmeier

Condorcet Computations.

  • (2010)
Journal article
  • Johannes Grabmeier

Vanishing ideals, order ideals and border bases - an implementation in the computer algebra system AXIOM/FriCAS. Technical Report MRSSC.

  • (2010)
Book
  • Johannes Grabmeier
  • Stefan Hagl

Statistik. Grundwissen und Formeln.

In: TaschenGuide vol. 215

Haufe Freiburg, Br; Planegg/München

  • (2010)
Book
  • Johannes Grabmeier
  • Stefan Hagl

Statistik. Grundwissen und Formeln.

In: TaschenGuide vol. 215

Haufe Freiburg

  • (2012)
Book
  • Johannes Grabmeier
  • Stefan Hagl

Statistik. Grundwissen und Formeln.

In: Haufe TaschenGuide vol. 216

Haufe Freiburg i. Breisgau

  • (2016)
Journal article
  • Johannes Grabmeier

Erfolgswertgleichheit und Spiegelbildlichkeitsgebot?. Quantitative Bewertung für die Gleichheit der Wahl und ihre Konsequenzen für Kommunalwahlgesetze.

In: Bayerische Verwaltungsblätter (BayVBl.) - Zeitschrift für öffentliches Recht und öffentliche Verwaltung pg. 761-772

  • (2016)
Contribution
  • H. Babovsky
  • Johannes Grabmeier

Calculus and design of discrete velocity models using computer algebra.

In: Proceedings of the 30th International Symposium on Rarefied Gas Dynamics (July 10-15th 2016; Victoria, BC, Canada). (AIP conference proceedings) pg. 18000301-18000308

  • Eds.:
  • H. Struchtrup
  • A. Ketsdever

AIP Publishing Melville, NY, USA

  • (2016)
Journal article
  • Johannes Grabmeier

Grundmandat, Bewertung des Gleichheitsgebots, Verzerrung – Fallstricke bei der Einsetzung von Untersuchungsausschüssen in Mecklenburg-Vorpommern.

In: Zeitschrift für Parlamentsfragen vol. 55 pg. 63-75

  • (2024)

DOI: 10.5771/0340-1758-2024-1-63

show abstract

The 8th state parliament of Mecklenburg-Western Pomerania has 79 members in six parlia- mentary party groups, which are represented with the following numbers of seats: SPD 34, AfD 14, CDU 12, Left Party 9, Greens and FDP with 5 each . A dispute arose over the appointment of two committees of inquiry . A majority of the state parliament approved two committees with nine members – four SPD MPs and one from each of the five other parliamentary party groups – at the suggestion of the governing coalition of the SPD and the Left Party . The proposal of the CDU, Greens and FDP to set up the committees with 13 members and a 6:2:2:1:1:1 distribution of seats was rejected . The disputes brought before the State Constitutional Court by the CDU as the applicant (LVerfG 3/22 and 4/22), were unsuccessful in the ruling of February 23, 2023 . The problem areas that arose can be outlined as follows: basic mandate, assessment of the principle of equality, and dis- tortion . This is shown in the article in the form of comments on the ruling of the State Constitutional Court . At the same time, solutions for avoiding such disputes and also for their adequate assessment are presented . First and foremost, there is a quality measure for the fulfillment of the mirror image principle, which provides a quality number for every conceivable distribution of seats, regardless of the chosen allocation procedure . This allows both the fulfillment of the principle of equality to be assessed and questions of distortion of a distribution to be quantified and thus objectively considered .
Journal article
  • Johannes Grabmeier

Wahlmathematische Anmerkungen zum Ausschussbesetzungsurteil des Landesverfassungsgerichts Mecklenburg-Vorpommern.

In: Zeitschrift für Öffentliches Recht in Norddeutschland (NordÖR) vol. 27 pg. 357-360

  • (2024)

projects

Quasi-Random-Sequences froma Structure Constants of Modules, Election Mathematics, Computer Algebra and Fluid Mechanics, Fuzzy Concepts

core competencies

Lectures:

  • Mathematics,
  • Inductive Statistics,
  • Cryptography,
  • Data Mining
  • Seminar Actual Topics in Business Informatics

    Kompetenzen und Beratung:

  • Mathematische Modellbildung
  • Computeralgebra
  • Wahlmathematik
  • Business Intelligence und Data Mining / Künstliche Intelligenz
  • Aufdeckung von Informationsmustern in Datenmengen
  • Clusteranalyse
  • Warenkorbanalyse,
  • Klassifikationen
  • Betrugsaufdeckung
  • Marketing: Cross-Selling, Up-Selling, Stornopotenzial
  • Consulting zu Maßnahmen und Prozessen in Business Intelligence

Vita

Akademischer Werdegang

  • Berufung: Prof. für Wirtschaftsinformatik Hochschule Deggendorf 2000

  • Promotion: Dr. rer. nat. Universität Bayreuth 1985

  • Studienabschluss: Universität München, Dipl.-Mathematiker, Nebenfach Informatik 1981

  • Studienabschluss: Master of Science, University of Warwick (GB) 1980

Beruflicher Werdegang

  • 1981-1986: Wissenschaftlicher Assistent am Lehrstuhl für Mathematik von Prof. Dr. Adalbert Kerber an der Universität Bayreuth*
  • 1986-2000: IBM Deutschland GmbH in verschiedenen Funktionen in Heidelberg, Frankfurt und Böblingen: Wissenschaftliches Zentrum in Heidelberg, Management im Lösungsbereich Vertrieb Banken, Consulting im Bereich Finanzdienstleister*
  • seit 2000: Professor an der Hochschule Deggendorf Studiengang Wirtschaftsinformatik Professor für Wirtschaftsinformatik und Informatik
  • 2009 - 2013: Dekan der Fakultät Angewandte Wirtschaftswissenschaften (School of Management)